Hardness and approximation of the asynchronous border minimization problem
نویسندگان
چکیده
منابع مشابه
Hardness and Approximation of The Asynchronous Border Minimization Problem
We study a combinatorial problem arising from the microarrays synthesis. The objective of the BMP is to place a set of sequences in the array and to find an embedding of these sequences into a common supersequence such that the sum of the “border length” is minimized. A variant of the problem, called P-BMP, is that the placement is given and the concern is simply to find the embedding. Approxim...
متن کاملHardness and Approximation of the Asynchronous Border Minimization Problem - (Extended Abstract)
We study a combinatorial problem arising from microarrays synthesis. The synthesis is done by a light-directed chemical process. The objective is to minimize unintended illumination that may contaminate the quality of experiments. Unintended illumination is measured by a notion called border length and the problem is called Border Minimization Problem (BMP). The objective of the BMP is to place...
متن کاملParameterized Complexity of Asynchronous Border Minimization
Microarrays are research tools used in gene discovery as well as disease and cancer diagnostics. Two prominent but challenging problems related to microarrays are the Border Minimization Problem (BMP) and the Border Minimization Problem with given placement (P-BMP). In this paper we investigate the parameterized complexity of natural variants of BMP and P-BMP, termed BMP and P-BMP respectively,...
متن کاملOn Approximation Hardness of the Bandwidth Problem
The bandwidth problem is the problem of enumerating the vertices of a given graph G such that the maximum diierence between the numbers of adjacent vertices is minimal. The problem has a long history and a number of applications and is known to be NP-hard, Papadimitriou Pa 76]. There is not much known though on approximation hardness of this problem. In this paper we show, that there are no eec...
متن کاملProblem Hardness Result Approximation ResultBSTP
Several problems arising in the areas of communication networks and VLSI design can be expressed in the following general form: Enhance the performance of an underlying network by upgrading some of its nodes. We investigate one such problem. Consider a network where nodes represent processors and edges represent bidirectional communication links. The processor at a node v can be upgraded at an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2018
ISSN: 0166-218X
DOI: 10.1016/j.dam.2017.08.025